package com.spirng.leetcode.day10;


public class Test343 {
    public static void main(String[] args) {
        Test343 test343 = new Test343();
        test343.integerBreak(10);
    }
    public int integerBreak(int n) {
        int dp[]=new int [n+1];
        dp[0]=0;
        dp[1]=0;
        dp[2]=1;
        for (int i = 3; i < n+1; i++) {
            for (int j = 1; j <= i/2; j++) {
                dp[i]=Max(j*(i-j),j*dp[i-j],dp[i]);
            }
        }
        return dp[n];
    }
    public int Max(int a,int b,int c){
        a=Math.max(a,b);
        a=Math.max(a,c);
        return a;
    }

}
